Nonlinear Analysis: Algorithm, Convergence, and Applications 2014

Nonlinear Convergence Analysis for the Parareal Algorithm

The Sinkhorn-Knopp Algorithm: Convergence and Applications

As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic. It is known that the convergence is linear and an upper bound has been given for the rate of convergence for positive matrices. In this paper we give an explicit expression for the ...

On the Convergence Analysis of Gravitational Search Algorithm

Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...

On the Convergence Analysis of Gravitational Search Algorithm

Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...

Convergence Analysis and Analog Circuit Applications for a Class of Networks of Nonlinear Coupled Oscillators

The physical motivation and rigorous proof of convergence for a particular network of nonlinear coupled oscillators are reviewed. Next, the network and convergence proof are generalized in several ways, to make the network more applicable to actual engineering problems. It is argued that such coupled oscillator circuits are more natural to implement in analog hardware than other types of dynami...